//We define the string base to be the infinite wraparound string of 
//"abcdefghijklmnopqrstuvwxyz", so base will look like this: 
//
// 
// "...zabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcd....". 
// 
//
// Given a string s, return the number of unique non-empty substrings of s are 
//present in base. 
//
// 
// Example 1: 
//
// 
//Input: s = "a"
//Output: 1
//Explanation: Only the substring "a" of s is in base.
// 
//
// Example 2: 
//
// 
//Input: s = "cac"
//Output: 2
//Explanation: There are two substrings ("a", "c") of s in base.
// 
//
// Example 3: 
//
// 
//Input: s = "zab"
//Output: 6
//Explanation: There are six substrings ("z", "a", "b", "za", "ab", and "zab") 
//of s in base.
// 
//
// 
// Constraints: 
//
// 
// 1 <= s.length <= 10⁵ 
// s consists of lowercase English letters. 
// 
//
// Related Topics 字符串 动态规划 👍 382 👎 0

package leetcode.editor.cn;
class P467UniqueSubstringsInWraparoundString{
    //2023-05-17 21:32:31
    //Unique Substrings in Wraparound String
    //编号：[467]
    
    public static void main(String[] args) {
    
        Solution solution = new  P467UniqueSubstringsInWraparoundString().new Solution();
        // TO TEST
    }
    //leetcode submit region begin(Prohibit modification and deletion)
class Solution {

}
//leetcode submit region end(Prohibit modification and deletion)

}